| 1. | Wave processing can be used to measure distances and find optimal paths.
|
| 2. | There are simple geometric and analytical methods to compute the optimal path.
|
| 3. | Execution is taking the most optimal path to meet an objective.
|
| 4. | Northstar helps find the optimal path for data to travel through a network.
|
| 5. | In other words, there is no unique definition of an optimal path under uncertainty.
|
| 6. | The more complicated problem is finding the optimal path.
|
| 7. | One way to find the optimal path is to use a branch and bound technique.
|
| 8. | However, this approach may result in sub-optimal paths.
|
| 9. | At the end of the search these references can be used to recover the optimal path.
|
| 10. | Perruchet and Gallego have demonstrated a method for calculating this optimal path using calculus in a different way.
|